Optimized Schwarz Methods for Circular Domain Decompositions with Overlap

نویسندگان

  • Martin J. Gander
  • Yingxiang Xu
چکیده

Optimized Schwarz methods are based on transmission conditions between subdomains which are optimized for the problem class that is being solved. Such optimizations have been performed for many different types of partial differential equations, but were almost exclusively based on the assumption of straight interfaces. We study in this paper the influence of curvature on the optimization, and we obtain four interesting new results: first, we show that the curvature does indeed enter the optimized parameters and the contraction factor estimates. Second, we develop an asymptotically accurate approximation technique, based on Turán type inequalities in our case, to solve the much harder optimization problem on the curved interface, and this approximation technique will also be applicable to currently too complex best approximation problems in the area of optimized Schwarz methods. Third, we show that one can obtain transmission conditions from a simple circular model decomposition which have also been found using microlocal analysis but that these are not the best choices for the performance of the optimized Schwarz method. Finally, we find that in the case of curved interfaces, optimized Schwarz methods are not necessarily convergent for all admissible parameters. Our optimization leads, however, to parameter choices that give the same good performance for a circular decomposition as for a straight interface decomposition. We illustrate our analysis with numerical experiments.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimized Schwarz methods with nonoverlapping circular domain decomposition

While the classical Schwarz method can only be used with overlap, optimized Schwarz methods can also be used without overlap, which can be an advantage when simulating heterogeneous problems, problems with jumping coefficients, or also for independent mesh generation per subdomain. The analysis of nonoverlapping optimized Schwarz methods has so far been restricted to the case of straight interf...

متن کامل

Optimized Schwarz method with two-sided transmission conditions in an unsymmetric domain decomposition

Domain decomposition (DD) methods are important techniques for designing parallel algorithms for solving partial differential equations. Since the decomposition is often performed using automatic mesh partitioning tools, one can in general not make any assumptions on the shape or physical size of the subdomains, especially if local mesh refinement is used. In many of the popular domain decompos...

متن کامل

Optimized Schwarz Methods without Overlap for the Helmholtz Equation

The classical Schwarz method is a domain decomposition method to solve elliptic partial differential equations in parallel. Convergence is achieved through overlap of the subdomains. We study in this paper a variant of the Schwarz method which converges without overlap for the Helmholtz equation. We show that the key ingredients for such an algorithm are the transmission conditions. We derive o...

متن کامل

Optimized Schwarz Methods with Overlap for the Helmholtz Equation

For the Helmholtz equation, simple absorbing conditions of the form ∂n − iω were proposed as transmission condition (TC) in Schwarz methods first without overlap in [4], and later also with overlap, see [3, 12]. More advanced TCs can also be used, see e.g. [11, 14, 2]. Furthermore, parameters can be introduced into TCs and then optimized for rapid convergence, which led to the so called optimiz...

متن کامل

Double Sweep Preconditioners for propagation problems solved by Optimized Schwarz Methods

We present a parallel version of the otherwise sequential double sweep preconditioner, used to accelerate the convergence of an optimized Schwarz domain decomposition method. The method is based on the same sweeping strategy, yet applied on a shorter scale and in parallel, on distinct groups of subdomains. The modi ed algorithm, unlike the original one designed for layered decompositions, has t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2014